Complexity reduction of significance map coding

ABSTRACT

The complexity of coding a significant_coeff_flag in video coding such as High Efficiency Video Coding (HEVC) is able to be reduced using the same mapping to select luma and chroma contexts for the coding of 4×4 significant maps. As a result, a 15 element lookup table and multiple branches are able to be removed to select the context index, and WD text is also simplified.

CROSS-REFERENCE TO RELATED APPLICATION

The present application is a continuation application of U.S. patent application Ser. No. 13/745,488, filed Jan. 18, 2013, and claims priority under 35 U.S.C. § 119(e) of the U.S. Provisional Patent Application Ser. No. 61/589,183, filed Jan. 20, 2012 and titled, “COMPLEXITY REDUCTION OF SIGNIFICANCE MAP CODING,” which is hereby incorporated by reference in its entirety for all purposes.

FIELD OF THE INVENTION

The present invention relates to the field of video coding. More specifically, the present invention relates the complexity reduction in video coding.

BACKGROUND OF THE INVENTION

For encoding the significant_coeff_flag, the following has been utilized: a 4×4 positional-based coding method which has 9 context for luma and 6 contexts for chroma; a 8×8 positional-based coding method which has 11 contexts for luma and 11 contexts for chroma; and a 16×16/32×32 mask-based coding method which has 7 contexts for luma and 4 contexts for chroma.

As shown in FIG. 1, the 4×4 positional-based coding method has different groupings of a significance map for luma 102 and chroma 100. Therefore, different mappings for chroma 102 and luma 100 are used to map the position in the significance map to the corresponding context index increment. As a result, the following complexities exist: two 15 element mapping tables are used to determine the context increment, and branches based on the luma/chroma decisions are needed to determine the context increment in the coding of 4×4, 8×8 and 16×16/32×32 significance maps.

SUMMARY OF THE INVENTION

The complexity of coding a significant_coeff_flag in video coding such as High Efficiency Video Coding (HEVC) is able to be reduced using the same mapping to select 4×4 luma and chroma contexts. As a result, a 15 element lookup table and multiple branches are able to be removed to select the context index of significant_coeff_flag, and WD text is also simplified.

In one aspect, a method of reducing complexity in coding of non-zero 4×4 significance map programmed in a device comprises scanning quantized transform coefficients, determining a position of a last non-zero quantized coefficient, and generating a significance map from the quantized transform coefficients, wherein a significance of a quantized transform coefficient before the last non-zero quantized coefficient has a same number of contexts and a same mapping for luma and chroma to determine context index increment. The context increment mapping comprises a single 15 element lookup table. The method further comprises coding video content without determining a context offset based on a luma/chroma decision of at least one of 8×8, 16×16, and 32×32 significance map. The device is selected from the group consisting of a personal computer, a laptop computer, a computer workstation, a server, a mainframe computer, a handheld computer, a personal digital assistant, a cellular/mobile telephone, a smart phone, a smart appliance, a gaming console, a digital camera, a digital camcorder, a camera phone, a portable music player, a tablet computer, a video player, a DVD writer/player, a high definition video writer/player, a television and a home entertainment system.

In another aspect, an encoder comprises a scanning module programmed in hardware configured for scanning quantized transform coefficients, a first generating module programmed in hardware configured for generating a position of a last non-zero quantized transform coefficient, and a second generating module programmed in hardware configured for generating a significance map from the quantized transform coefficients, wherein a significance of a quantized transform coefficient before the last non-zero quantized coefficient has a same number of contexts and a same mapping for luma and chroma to determine context index increment. The context increment mapping comprises a single 15 element lookup table. The encoder further comprises a coding module programmed in hardware for coding video content without determining a context offset based on a luma/chroma decision of at least one of 8×8, 16×16, and 32×32 significance map. The encoder is contained within a device selected from the group consisting of a personal computer, a laptop computer, a computer workstation, a server, a mainframe computer, a handheld computer, a personal digital assistant, a cellular/mobile telephone, a smart phone, a smart appliance, a gaming console, a digital camera, a digital camcorder, a camera phone, a portable music player, a tablet computer, a video player, a DVD writer/player, a high definition video writer/player, a television and a home entertainment system.

In another aspect, an apparatus comprises a non-transitory memory for storing an application, the application for generating a significance map from quantized transform coefficients, wherein a significance of a quantized transform coefficient before the last non-zero quantized coefficient has a same number of contexts and a same mapping for luma and chroma to determine context index increment and a processing component coupled to the memory, the processing component configured for processing the application. The application is further for scanning the quantized transform coefficients. The context increment mapping comprises a single 15 element lookup table. The application is further for coding video content without determining a context offset based on a luma/chroma decision of at least one of 8×8, 16×16, and 32×32 significance map.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a diagram of a significance map with different groupings for the luma and chroma contexts according to some embodiments.

FIG. 2 illustrates a diagram of a significance map with where the luma and chroma contexts have the same number of contexts and the same context index increment mapping according to some embodiments.

FIG. 3 illustrates a flowchart of a method of complexity reduction of significance map coding according to some embodiments.

FIG. 4 illustrates a block diagram of an exemplary computing device configured to implement the reduced complexity significance map coding method according to some embodiments.

FIG. 5 illustrates a general diagram of an HEVC encoder according to some embodiments.

FIG. 6 illustrates a general diagram of an HEVC decoder according to some embodiments.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

Video compression is utilized to transmit and receive digital video information more efficiently. Video compression utilizes techniques to reduce or remove redundant data in video sequences. In High Efficiency Video Coding (HEVC), a video frame is partitioned into coding units (CUs). CUs are able to be split into smaller blocks for prediction or transform. Each CU is able to be further partitioned into prediction units (PUs) and transform units (TUs).

A CU typically has a luminance component, denoted as Y, and two chroma components, denoted as U and V.

To code a data block, a predictive block for the block is derived. The predictive block, is able to be derived either through intra (I) prediction (e.g., spatial prediction) or inter (P or B) prediction (e.g., temporal prediction). Upon identification of a predictive block, the difference between the original video data block and its predictive block is determined. This difference is referred to as the prediction residual data, and indicates the pixel differences between the pixel values in the block to the coded and the pixel values in the predictive block selected to represent the coded block. To achieve better compression, the prediction residual data is able to be transformed (e.g., using a discrete cosine transform (DCT) or another transform).

The residual data in a transform block is able to be arranged in a two-dimensional (2D) array of pixel difference values residing in the spatial, pixel domain. A transform converts the residual pixel values into a two-dimensional array of transform coefficients in a transform domain, such as a frequency domain. For further compression, the transform coefficients are able to be quantized prior to entropy coding. An entropy coder applies entropy coding, such as Context Adaptive Variable Length Coding (CAVLC), Context Adaptive Binary Arithmetic Coding (CABAC), Probability Interval Partitioning Entropy Coding (PIPE), or another entropy coding, to the quantized transform coefficients.

To entropy code a block of quantized transform coefficients, a scanning process is usually performed so that the two-dimensional (2-D) array of quantized transform coefficients in a block is processed, according to a particular scan order, in an ordered, one-dimensional (1-D) array (e.g., vector) of transform coefficients. Entropy coding is applied in the 1-D order of transform coefficients. The scan of the quantized transform coefficients in a transform unit serializes the 2-D array of transform coefficients for the entropy coder. A significance map is able to be generated to indicate the positions of significant (e.g., non-zero) coefficients. Scanning is able to be applied to code levels of significant (e.g., nonzero) coefficients, and/or to code signs of the significant coefficients.

In the HEVC Standard, 4×4 non-zero coefficient locations are encoded by means of a 4×4 significance map. The 4×4 significance map in the HEVC Standard is encoded as follows. The coordinate of the last significant coefficient is transmitted. Then for each coefficient before the last significant coefficient in scanning order, a one-bit symbol significant_coeff_flag is transmitted.

The complexity of coding a significant_coeff_flag in video coding such as High Efficiency Video Coding (HEVC) is able to be reduced using the same mapping to select luma and chroma contexts. As a result, a 15 element lookup table and multiple branches are able to be removed to select the context index, and WD text is also simplified. A reduction of decoder runtime of 0-3% has been observed in HM5.0. The BD-rate for AI_HE, RA_HE, LB_HE are 0.00%, −0.01%, 0.01%, respectively. The BD-rate for AI_LC, RA_LC, LB_LC are 0.00%, 0.01%, −0.01%, respectively. The BD-rate for RA_HE10 is 0.03%.

As shown by the grouping colors in FIG. 2, the same grouping of the 4×4 luma 200 contexts are able to be reused for the grouping of the 4×4 chroma contexts 202. As a result, complexity is reduced in the following aspects: the chroma 15 elements mapping table previously used is removed Branches based on the luma/chroma decision to determine the initial context offset in at least one of 8×8/16×16/32×32 significance map are also removed.

The context reductions were integrated into HM5.0. The simulations were performed in three Microsoft HPC clusters, the common test conditions and reference configurations are followed:

All intra simulations are performed on AMD Opteron Processor 6136 cluster @ 2.4 GHz.

All RA simulations are performed on Intel Xeon X5690 cluster @ 3.47 GHz.

All LD simulations are performed on Intel Xeon X5680 cluster @ 3.33 GHz. Table 1 shows the BD-rate and timing of the complexity reduction for the coding of significance map.

TABLE 1 BD-rate of complexity reductions. All Intra HE AP Intra LC All Intra HE-10 Y U V Y U V Y U V Class A (8 bit) 0.00% −0.02% −0.02% 0.00%   0.01% −0.01% Class B 0.00% −0.03%   0.01% 0.00%   0.00%   0.03% Class C 0.01% −0.06% −0.02% 0.00% −0.01%   0.00% Class D 0.00%   0.01% −0.04% 0.00%   0.02% −0.02% Class E 0.00%   0.00%   0.00% 0.00%   0.02% −0.02% Overall 0.00% −0.02% −0.01% 0.00%   0.01%   0.00% 0.00% −0.02% −0.01% 0.00%   0.01%   0.00% Class F #VALUE! #VALUE! #VALUE! #VALUE! #VALUE! #VALUE! Enc Time[%] 100% 100% Dec Time[%]  99% 100% Random Access HE Random Access LC Random Access HE-10 Y U V Y U V Y U V Class A (8 bit) −0.03% −0.11% −0.21%   0.00%   0.07% −0.17% 0.03%   0.15%   0.13% Class B   0.00% −0.06% −0.01%   0.02%   0.15%   0.20% 0.03% −0.05% −0.09% Class C −0.04% −0.06%   0.07%   0.02% −0.03% −0.06% Class D   0.03% −0.19%   0.06% −0.01%   0.31% −0.24% Class E Overall −0.01% −0.10%   0.01%   0.01%   0.14% −0.03% 0.03%   0.04%   0.00% −0.01% −0.13%   0.01%   0.01%   0.11% −0.07% 0.04%   0.07%   0.05% Class F *VALUE! *VALUE! *VALUE! *VALUE! *VALUE! Enc Time[%] 100% 100% 100% Dec Time[%]  99%  99% 100% Low delay B HE Low delay B LC Low delay B HE-10 Y U V Y U V Y U V Class A Class B   0.01%   0.02%   0.10% −0.04% −0.12%   0.17% Class C   0.01% −0.01%   0.09%   0.03%   0.08%   0.06% Class D −0.02% −0.05%   0.10% −0.02%   0.63% −0.09% Class E   0.07% −0.37% −0.43%   0.03%   0.09% −0.10% Overall   0.01% −0.08%   0.00% −0.01%   0.16%   0.03%   0.01% −0.05% −0.03% −0.01%   0.19%   0.05% Class F *VALUE! *VALUE! *VALUE! *VALUE! *VALUE! *VALUE! Enc Time[%] 100% 100% Dec Time[%]  97%  99% As shown in Table 3, the method described herein reduced the decoder execution time from 0% to 3% and resulted in average luminance BD-rate of −0.01% to 0.03%.

TABLE 2 Average decoder time of significance map coding complexity reduction HE LC HE-10 I 99% 100% RA 99%  99% 100% LB 97%  99%

TABLE 3 Average BDR of significance map coding complexity reduction. HE LC HE-10 I 0.00% 0.00% RA −0.01%  0.01% 0.03% LB 0.01% −0.01%  The following is the derivation process of ctxIdxInc for the syntax element significant_coeff_flag modified with respect to HM5.0:

Inputs to this process are the color component index cIdx, the current coefficient scan position (xC, yC), the transform block width log 2TrafoWidth and the transform block height log 2TrafoHeight.

Output of this process is ctxIdxInc.

The variable sigCtx depends on the current position (xC, yC), the color component index cIdx, the transform block size and previously decoded bins of the syntax element significant_coeff_flag. For the derivation of sigCtx, the following applies.

If log 2TrafoWidth is equal to log 2TrafoHeight and log 2TrafoWidth is equal to 2, sigCtx is derived using ctxIdxMap4×4[ ] specified in Table 4 as follows.

sigCtx=ctxIdxMap4×4[(yC<<2)+xC]

Otherwise if log 2TrafoWidth is equal to log 2TrafoHeight and log 2TrafoWidth is equal to 3, sigCtx is derived using ctxIdxMap8×8[ ] specified in Table 5 as follows.

sigCtx=((xC+yC)==0)?10:ctxIdxMap8×8[((yC>>1)<<2)+(xC>>1)]

sigCtx+=9

Otherwise if xC+yC is equal to 0, sigCtx is derived as follows.

sigCtx=20

Otherwise (xC+yC is greater than 0), sigCtx is derived using previously decoded bins of the syntax element significant_coeff_flag as follows.

The variable sigCtx is initialized as follows.

sigCtx=0

When xC is less than (1<<log 2TrafoWidth)−1, the following applies.

sigCtx=sigCtx+significant_coeff_flag[xC+1][yC]

When xC is less than (1<<log 2TrafoWidth)−1 and yC is less than (1<<log 2TrafoHeight)−1, the following applies.

sigCtx=sigCtx+significant_coeff_flag[xC+1][yC+1]

When xC is less than (1<<log 2Width)−2, the following applies.

sigCtx=sigCtx+significant_coeff_flag[xC+2][yC]

When all of the following conditions are true,

yC is less than (1<<log 2TrafoHeight)−1,

xC % 4 is not equal to 0 or yC % 4 is not equal to 0,

xC % 4 is not equal to 3 or yC % 4 is not equal to 2, the following applies.

sigCtx=sigCtx+significant_coeff_flag[xC][yC+1]

When yC is less than (1<<log 2TrafoHeight)−2 and sigCtx is less than 4, the following applies.

sigCtx=sigCtx+significant_coeff_flag[xC][yC+2]

The variable sigCtx is modified as follows.

If cIdx is equal to 0 and xC+yC are greater than (1<<(max(log 2TrafoWidth, log 2TrafoHeight)−2))−1, the following applies.

sigCtx=((sigCtx+1)>>1)+24

Otherwise, the following applies.

sigCtx=((sigCtx+1)>>1)+21

The context index increment ctxIdxInc is derived using the color component index cIdx and sigCtx as follows.

If cIdx is equal to 0, ctxIdxInc is derived as follows.

ctxIdxInc=sigCtx

Otherwise (cIdx is greater than 0), ctxIdxInc is derived as follows.

ctxIdxInc=27+sigCtx

TABLE 4 Specification of ctxIdxMap4 × 4[i] i 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ctxIdxMap4 × 4[i] 0 1 4 5 2 3 4 5 6 6 8 8 7 7 8

TABLE 5 Specification of ctxIdxMap8 × 8[i] i 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 ctxIdxMap8 × 8[i] 0 1 2 3 4 5 6 3 8 6 6 7 9 9 7 7 The context derivation assumes maximum transform sizes less than or equal to 32×32 for luma and 16×16 for chroma and minimum transform sizes greater than or equal to 4×4.

TABLE 6 Values of variable initValue for significant_coeff_flag ctxIdx Initialisation variable significant coeff flag ctxIdx 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 initValue 74 73 88 72 72 55 71 54 71 88_ 103 71 53 87 134 86 84 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 initValue 70 68 89 90 84 88 74 130 118 88 120 87 87 87 149 52 70 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 initValue 52 118 133 116 114 129 132 162 115 51 115 66 120 74 115 87 89 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 initValue 152 119 103 118 87 70 70 53 118 134 118 101 68 85 101 116 100 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 initValue 68 67 135 168 147 150 120 115 118 119 136 102 102 102 70 67 53 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 initValue 67 117 102 117 1158 114 84 115 99 100 83 114 152 168 131 150 120 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 initValue 152 119 103 118 87 70 70 53 71 103 118 101 68 85 101 116 116 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 initValue 68 67 152 168 147 150 120 115 118 119 136 102 102 102 86 67 84 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 initValue 67 117 102 117 115 99 100 115 99 100 83 114 152 152 131 150 120

FIG. 3 illustrates a flowchart of a method of complexity reduction of 4×4 significance map coding according to some embodiments. In the step 300, quantized transform coefficients with at least one non-zero quantized transform coefficient are scanned. In step 302, the position of the last non-zero quantized coefficients in a scan order is determined. In step 304, the position of the last coefficients is encoded. In step 306, the significance of the quantized transform coefficients before the last non-zero coefficient is encoded with the same number of contexts and context increment mapping for luma and chroma coefficients. In some embodiments, more or fewer steps are implemented. In some embodiments, the order of the steps is modified.

FIG. 4 illustrates a block diagram of an exemplary computing device configured to implement the reduced complexity significance map coding method according to some embodiments. The computing device 400 is able to be used to acquire, store, compute, process, communicate and/or display information such as images and videos. In general, a hardware structure suitable for implementing the computing device 400 includes a network interface 402, a memory 404, a processor 406, I/O device(s) 408, a bus 410 and a storage device 412. The choice of processor is not critical as long as a suitable processor with sufficient speed is chosen. The memory 404 is able to be any conventional computer memory known in the art. The storage device 412 is able to include a hard drive, CDROM, CDRW, DVD, DVDRW, Blu-Ray®, flash memory card or any other storage device. The computing device 400 is able to include one or more network interfaces 402. An example of a network interface includes a network card connected to an Ethernet or other type of LAN. The I/O device(s) 408 are able to include one or more of the following: keyboard, mouse, monitor, screen, printer, modem, touchscreen, button interface and other devices. Reduced complexity significance map coding application(s) 430 used to perform the reduced complexity significance map coding method are likely to be stored in the storage device 412 and memory 404 and processed as applications are typically processed. More or less components shown in FIG. 4 are able to be included in the computing device 400. In some embodiments, reduced complexity significance map coding hardware 420 is included. Although the computing device 400 in FIG. 4 includes applications 430 and hardware 420 for the reduced complexity significance map coding method, the reduced complexity significance map coding method is able to be implemented on a computing device in hardware, firmware, software or any combination thereof. For example, in some embodiments, the reduced complexity significance map coding applications 430 are programmed in a memory and executed using a processor. In another example, in some embodiments, the reduced complexity significance map coding hardware 420 is programmed hardware logic including gates specifically designed to implement the reduced complexity significance map coding method.

In some embodiments, the reduced complexity significance map coding application(s) 430 include several applications and/or modules. In some embodiments, modules include one or more sub-modules as well. In some embodiments, fewer or additional modules are able to be included.

Examples of suitable computing devices include a personal computer, a laptop computer, a computer workstation, a server, a mainframe computer, a handheld computer, a personal digital assistant, a cellular/mobile telephone, a smart appliance, a gaming console, a digital camera, a digital camcorder, a camera phone, a smart phone, a portable music player, a tablet computer, a mobile device, a video player, a video disc writer/player (e.g., DVD writer/player, Blu-Ray® writer/player), a television, a home entertainment system or any other suitable computing device.

FIG. 5 illustrates a general diagram of an HEVC encoder according to some embodiments. The encoder 500 includes a general coder control component, a transform scaling and quantization component, a scaling and inverse transform component, an intra-picture estimation component, an intra-picture prediction component, a deblocking and SAO filters component, a motion compensation component, a motion estimation component, and a header formatting and CABAC component. An input video signal is received by the encoder 500 and is split into Coding Tree Units (CTUs). The HEVC encoder components process the video data and generate a coded bitstream. The encoder 500 implements complexity reduction of significant map coding.

FIG. 6 illustrates a general diagram of an HEVC decoder according to some embodiments. The decoder 600 includes an entropy decoding component, an inverse quantization component, an inverse transform component, a current frame component, an intra prediction component, a previous frames component, a motion compensation component, a deblocking filter, and an SAO component. An input bitstream (e.g., a coded video) is received by the decoder 600, and a decoded bitstream is generated for display.

To utilize the reduced complexity significance map coding method, a device such as a digital camera is able to be used to acquire a video. The reduced complexity significance map coding method is automatically used for performing video processing. The reduced complexity significance map coding method is able to be implemented automatically without user involvement.

In operation, the reduced complexity map coding method reduces the complexity of coding a significant_coeff_flag in video coding such as High Efficiency Video Coding (HEVC) by using the same mapping to select luma and chroma contexts. As a result, a 15 element lookup table and multiple branches are able to be removed to select the context index, and WD text is also simplified.

Some Embodiments of Complexity Reduction of Significance Map Coding

1. A method of reducing complexity in coding of non-zero 4×4 significance map programmed in a device comprising:

a. scanning quantized transform coefficients;

b. determining a position of a last non-zero quantized coefficient; and

c. generating a significance map from the quantized transform coefficients, wherein the significance of the quantized transform coefficients before the last non-zero quantized coefficient has a same number of contexts and a same mapping for luma and chroma to determine context index increment.

2. The method of clause 1 wherein the context increment mapping comprises a single 15 element lookup table.

3. The method of clause 1 further comprising coding video content without determining a context offset based on a luma/chroma decision of at least one of 8×8, 16×16, and 32×32 significance map.

4. The method of clause 1 wherein the device is selected from the group consisting of a personal computer, a laptop computer, a computer workstation, a server, a mainframe computer, a handheld computer, a personal digital assistant, a cellular/mobile telephone, a smart phone, a smart appliance, a gaming console, a digital camera, a digital camcorder, a camera phone, a portable music player, a tablet computer, a video player, a DVD writer/player, a high definition video writer/player, a television and a home entertainment system.

5. An encoder comprising:

a. a scanning module programmed in hardware configured for scanning quantized transform coefficients;

b. a first generating module programmed in hardware configured for generating a position of a last non-zero quantized transform coefficient; and

c. a second generating module programmed in hardware configured for generating a significance map from the quantized transform coefficients, wherein the significance of the quantized transform coefficient before the last non-zero quantized coefficient has a same number of contexts and a same mapping for luma and chroma to determine context index increment.

6. The encoder of clause 5 wherein the context increment mapping comprises a single 15 element lookup table.

7. The encoder of clause 5 further comprising a coding module programmed in hardware for coding video content without determining a context offset based on a luma/chroma decision of at least one of 8×8, 16×16, and 32×32 significance map.

8. The encoder of clause 5 wherein the encoder is contained within a device selected from the group consisting of a personal computer, a laptop computer, a computer workstation, a server, a mainframe computer, a handheld computer, a personal digital assistant, a cellular/mobile telephone, a smart phone, a smart appliance, a gaming console, a digital camera, a digital camcorder, a camera phone, a portable music player, a tablet computer, a video player, a DVD writer/player, a high definition video writer/player, a television and a home entertainment system.

9. An apparatus comprising:

a. a non-transitory memory for storing an application, the application for generating a significance map from quantized transform coefficients, wherein a significance of a quantized transform coefficient before a last non-zero quantized coefficient has a same number of contexts and a same mapping for luma and chroma to determine context index increment; and

b. a processing component coupled to the memory, the processing component configured for processing the application.

10. The apparatus of clause 9 wherein the application is further for scanning the quantized transform coefficients.

11. The apparatus of clause 9 wherein the context increment mapping comprises a single 15 element lookup table.

12. The apparatus of clause 9 wherein the application is further for coding video content without determining a context offset based on a luma/chroma decision of at least one of 8×8, 16×16, and 32×32 significance map.

The present invention has been described in terms of specific embodiments incorporating details to facilitate the understanding of principles of construction and operation of the invention. Such reference herein to specific embodiments and details thereof is not intended to limit the scope of the claims appended hereto. It will be readily apparent to one skilled in the art that other various modifications may be made in the embodiment chosen for illustration without departing from the spirit and scope of the invention as defined by the claims. 

1. A decoding device, comprising: circuitry configured to: apply significance map decoding, to luma components of quantized transform coefficients of a 4×4 block and chroma components of the quantized transform coefficients of the 4×4 block according to the following table: Specification of ctxIdxMap4 × 4[i] i 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ctxIdxMap4 × 4[i] 0 1 4 5 2 3 4 5 6 6 8 8 7 7 8


2. The decoding device according to claim 1, wherein the table is a mapping table between each index for the quantized transform coefficients of the 4×4 block and each context index for the quantized transform coefficients of the 4×4 block.
 3. The decoding device according to claim 2, wherein the table is a mapping table between each index for the quantized transform coefficients of the 4×4 block and each variable sigCtx in case of deriving the context index.
 4. The decoding device according to claim 3, wherein the variable sigCtx is derived, as a current coefficient scan position (xC, yC), based on ctxIdxMap[ ] specified in the table.
 5. The decoding device according to claim 4, wherein the circuitry is further configured to assign each context of significant_coeff_flag based on the corresponding quantized transform coefficient level that is non-zero.
 6. The decoding device according to claim 1, wherein formation of the 4×4 block is by recursive split of a coding block into transform blocks as block partitioning.
 7. A decoding method, comprising: in a decoding device: applying significance map decoding, to luma components of quantized transform coefficients of a 4×4 block and chroma components of the quantized transform coefficients of the 4×4 block according to the following table: Specification of ctxIdxMap4 × 4[i] i 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ctxIdxMap4 × 4[i] 0 1 4 5 2 3 4 5 6 4 8 8 7 7 8


8. The decoding method of claim 7, wherein the table is a mapping table between each index for the quantized transform coefficients of the 4×4 block and each context index for the quantized transform coefficients of the 4×4 block.
 9. The decoding method of claim 8, wherein the table is a mapping table between each index for the quantized transform coefficients of the 4×4 block and each variable sigCtx in case of deriving the context index.
 10. The decoding method of claim 9, wherein the variable sigCtx is derived, as a current coefficient scan position (xC, yC), based on ctxIdxMap[ ] as specified in the table.
 11. The decoding method of claim 10, further comprising assigning each context of significant_coeff_flag based on the corresponding quantized transform coefficient level that is non-zero.
 12. The decoding method of claim 7, wherein formation of the 4×4 block is by recursively splitting a coding block into transform blocks as block partitioning. 